A Parallel Resolution Procedure Based on Connection Graph

In this paper, we present a new approach towards a parallel resolution procedure which explores another dimension of parallelism in addition to the AND/OR formulation and special hardware constructs. The approach organizes the input clauses of a problem domain into a connection graph. The connection graph is then partitioned and each partition is worked on by a different processor of a multiprocessor system. These processors execute the resolution procedure independently on its partition, and exchange intermediate results via clause migrations. pair of literals which have the same predicate symbol and are complementary in sign. If the unification attempt between two literals succeeded, these two unifiable literals are marked by a link and the resulting MGU (the most general unifier) is used to label this link. Given the clause set of Figure l.a, the corresponding graph structure is shown in Figure 1.b. Preliminary test results and qualitative assessments of this procedure are also given.